Notions of computability at higher types III
نویسنده
چکیده
Examples 1.2 (i) Let 1 be the singleton type world {⋆}, with ⋆ → ⋆ = ⋆×⋆ = ⋆). (ii) Let F (γ1, . . . , γr) be the set of finite or simple types, freely generated via × and → from the basic type names γ1, . . . , γr. Important examples are F (ι) and F (ι, o), where ι and o are thought of as the types of natural numbers and booleans respectively. (iii) Richer languages of types, for example as in the recursively-typed language FPC [FP94], also give examples of type worlds.
منابع مشابه
Notions of computability at higher types I
We discuss the conceptual problem of identifying the natural notions of computability at higher types (over the natural numbers). We argue for an eclectic approach, in which one considers a wide range of possible approaches to defining higher type computability and then looks for regularities. As a first step in this programme, we give an extended survey of the different strands of research on ...
متن کاملNotions of computability at higher types II
In Part I of this series of papers [Lon01a] we gave a historical survey of the study of notions of higher-type computability. In the present paper and its sequel [Lon01b], we undertake a more systematic exposition of notions of higher-type computability, showing how many of the existing ideas and results can be fitted into a coherent framework. In Part II we will restrict our attention to notio...
متن کاملAn intrinsic treatment of ubiquity phenomena in higher-order computability models
We introduce some simple conditions on typed partial combinatory algebras (viewed as models of higher-order computability) which suffice for an axiomatic development of some non-trivial computability theory, including various forms of the Kreisel-LacombeShoenfield theorem, along with the author’s earlier ‘ubiquity’ theorems which say that a wide range of computability models all give rise to th...
متن کاملComputability theoretic classifications for classes of structures
In this paper, we survey recent work in the study of classes of structures from the viewpoint of computability theory. We consider different ways of classifying classes of structures in terms of their global properties, and see how those affect the structures inside the class. On one extreme, we have the classes that are Σ-small. These are the classes which realize only countably many ∃-types, ...
متن کاملComputable operators on regular sets
For regular sets in Euclidean space, previous work has identified twelve ‘basic’ computability notions to (pairs of) which many previous notions considered in literature were shown to be equivalent. With respect to those basic notions we now investigate on the computability of natural operations on regular sets: union, intersection, complement, convex hull, image, and pre-image under suitable c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001